On k-leaf-connected graphs
نویسندگان
چکیده
منابع مشابه
On k-chromatically connected graphs
A graph G is chromatically k–connected if every vertex cutset induces a subgraph with chromatic number at least k. Thus, in particular each neighborhood has to induce a k–chromatic subgraph. In [3], Godsil, Nowakowski and Nešetřil asked whether there exists a k–chromatically connected graph such that every minimal cutset induces a subgraph with no triangles. We show that the answer is positive ...
متن کاملON GENERALIZED k-DIAMETER OF k-REGULAR k-CONNECTED GRAPHS
In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph on n vertices has the generalized k-diameter at most n/2 and this upper bound cannot be improved when n = 4k − 6 + i(2k − 4).
متن کاملOn critically k-edge-connected graphs
Let G be a simple graph on n vertices having edge-connectivity /(.' (G) > a and minimum degree o(G) We say G is k-critical if /(.' (G) = k and /(.' (G e) < k for every edge e of G. In this paper we prove that a k-critical graph has 1<' (G) o(G). We descri be a number of classes of k-cri tical graphs and consider the problem of determining the edge-maximal ones.
متن کاملOn connected k-domination in graphs
Let G = (V (G), E(G)) be a simple connected graph, and let k be a positive integer. A subset D ⊆ V (G) is a connected k-dominating set of G if its induced subgraph is connected and every vertex of V (G) −D is adjacent to at least k vertices of D. The connected k-domination number γ k(G) is the minimum cardinality among the connected k-dominating sets of G. In this paper, we give some properties...
متن کاملOn connected (γ, k)-critical graphs
A graph G is said to be (γ, k)-critical if γ(G−S) < γ(G) for any set S of k vertices and domination number γ. Properties of (γ, k)-critical graphs are studied for k ≥ 3. Ways of constructing a (γ, k)-critical graph from smaller (γ, k)-critical graphs are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1986
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90023-7